Conditioning of convex piecewise linear stochastic programs
نویسندگان
چکیده
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal solution of such a problem we associate a condition number which characterizes well or ill conditioning of the problem. Using theory of Large Deviations we show that the sample size needed to calculate the optimal solution of such problem with a given probability is approximately proportional to the condition number.
منابع مشابه
Joint rectangular geometric chance constrained programs
This paper discusses joint rectangular geometric chance constrained programs. When the stochastic parameters are elliptically distributed and pairwise independent, we present a reformulation of the joint rectangular geometric chance constrained programs. As the reformulation is not convex, we propose new convex approximations based on variable transformation together with piecewise linear appro...
متن کاملANOVA decomposition of convex piecewise linear functions
Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain, but do not belong to tensor product Sobolev spaces. Motivated by applying Quasi-Monte Carlo methods we show that all terms of their ANOVA decomposition, except the one of highest order, are smooth if the underlying densities are smooth and a certain geometric condition is...
متن کاملAn Adaptive Approximation Method for Stochastic, Dynamic Programs, with Applications to Inventory and Distribution Problems
We introduce a technique called Concave, Adaptive Value Estimation (CAVE) to approximate recourse functions found in stochastic programs. CAVE constructs a sequence of concave (or convex) piecewise-linear approximations using sample gradients of the recourse function at di erent points in the domain. The result is a nonlinear approximation that is more responsive than traditional stochastic qua...
متن کاملConditioning of stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value function. With an optimal solution of such a (convex) problem we associate a condition number which characterizes well or ill conditioning of the problem. We show that the sample size needed to calculate the optimal solution of such problem with a given probability is approximate...
متن کاملConvex Optimal Uncertainty Quantification
Optimal uncertainty quantification (OUQ) is a framework for numerical extreme-case analysis of stochastic systems with imperfect knowledge of the underlying probability distribution. This paper presents sufficient conditions under which an OUQ problem can be reformulated as a finite-dimensional convex optimization problem, for which efficient numerical solutions can be obtained. The sufficient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 94 شماره
صفحات -
تاریخ انتشار 2002